{	27 March 2011. Individual Olympiad. Problem set: http://neerc.ifmo.ru/school/io/archive/20110327/problems-individual-20110327.pdf
	Problem A
	Points: 100	
}
const bad=maxlongint;
      good=11117;
var n,i:longint; res,m1,m2:int64; a,b,x,y,r:array[1..110] of int64; f:boolean;
begin
reset(input,'jedivssith.in');
rewrite(output,'jedivssith.out');
read(n);
fillchar(r,sizeof(r),0);
for i:=1 to n do read(A[i]);
for i:=1 to n do read(x[i]);
for i:=1 to n do read(b[i]);
for i:=1 to n do read(y[i]);
f:=true;
for i:=1 to n do begin
  if x[i]=y[i] then begin
    if a[i]>=b[i] then r[i]:=good else r[i]:=-bad;
  end else
  if a[i]>b[i] then begin
    if x[i]>y[i] then r[i]:=good else r[i]:=-((a[i]-b[i]-1) div (y[i]-x[i])+1);
  end else
  if b[i]>a[i] then begin
    if x[i]<y[i] then r[i]:=-bad else r[i]:=(b[i]-a[i]-1) div (x[i]-y[i])+1;
  end;
end;
for i:=1 to n do
  if r[i]=-bad then f:=false;
res:=0;
if f then begin
  m1:=-bad;
  m2:=0;
  for i:=1 to n do begin
    if (r[i]>0) and (r[i]>m2) and (r[i]<>bad) and (r[i]<>good) then m2:=r[i] else
    if (r[i]<0) and (r[i]>m1) and (r[i]<>-bad) then m1:=r[i];
  end;
  if abs(m1)<m2 then f:=false else res:=m2;
end;
if f then write(res) else write('Strong is dark side of the force.');
end.
 